A fully stochastic primal-dual algorithm
نویسندگان
چکیده
منابع مشابه
Primal-Dual Stochastic Hybrid Approximation Algorithm
A new algorithm for solving convex stochastic optimization problems with expectation functions in both the objective and constraints is presented. The algorithm combines a stochastic hybrid procedure, which was originally designed to solve problems with expectation only in the objective, with dual stochastic gradient ascent. More specifically, the algorithm generates primal iterates by minimizi...
متن کاملA Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However,...
متن کاملA first-order stochastic primal-dual algorithm with correction step
We investigate the convergence properties of a stochastic primal-dual splitting algorithm for solving structured monotone inclusions involving the sum of a cocoercive operator and a composite monotone operator. The proposed method is the stochastic extension to monotone inclusions of a proximal method studied in [26, 35] for saddle point problems. It consists in a forward step determined by the...
متن کاملThe Primal - dual Algorithm
As we have seen before, using strong duality, we know that the optimum value for the following two linear programming are equal, i.e. u = w, if they are both feasible. u = max{cx : Ax ≤ b, x ≥ 0} (P ) w = min{b y : A y ≥ c, y ≥ 0} (D) Using the above result, we can check the optimality of a primal and/or a dual solution. Theorem 1. Suppose x and y are feasible solutions to (P ) and (D). Then x ...
متن کاملStochastic Inertial primal-dual algorithms
We propose and study a novel stochastic inertial primal-dual approach to solve composite optimization problems. These latter problems arise naturally when learning with penalized regularization schemes. Our analysis provide convergence results in a general setting, that allows to analyze in a unified framework a variety of special cases of interest. Key in our analysis is considering the framew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2020
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-020-01614-y